Approximating the multi-level bottleneck assignment problem
نویسندگان
چکیده
منابع مشابه
Approximating the Multi-level Bottleneck Assignment Problem
We consider the multi-level bottleneck assignment problem (MBA). This problem is described in the recent book “Assignment Problems” by Burkard et al. (2009) on pages 188 189. One of the applications described there concerns bus driver scheduling. We view the problem as a special case of a bottleneck m-dimensional multi-index assignment problem. We give approximation algorithms and inapproximabi...
متن کاملOn the Approximability of Multi-level Bottleneck Assignment Problem
We revisit the multi-level bottleneck assignment problem and study the approximability when there are m > 3 sets. We show that with respect to the approximability the problem exhibits an easy to hard transition. More specifically, we give a PTAS to the easiest hard case which is when the alternative edge-sets are complete, and prove that it is NP-hard to approximate the problem to within a rati...
متن کاملAsymptotic Moments of the Bottleneck Assignment Problem
One of the most important variants of the standard linear assignment problem is the bottleneck assignment problem. In this paper we give a method by which one can find all of the asymptotic moments of a random bottleneck assignment problem in which costs (independent and identically distributed) are chosen from a wide variety of continuous distributions. Our method is obtained by determining th...
متن کاملApproximating Geometric Bottleneck Shortest Paths
In a geometric bottleneck shortest path problem, we are given a set S of n points in the plane, and want to answer queries of the following type: Given two points p and q of S and a real number L, compute (or approximate) a shortest path between p and q in the subgraph of the complete graph on S consisting of all edges whose lengths are less than or equal to L. We present efficient algorithms f...
متن کاملMulti-Level Partitioning and Distribution of the Assignment Problem for Large-Scale Multi-Robot Task Allocation
A team of robots can handle failures and dynamic tasks by repeatedly assigning functioning robots to tasks. This paper introduces an algorithm that scales to large numbers of robots and tasks by exploiting both task locality and sparsity. The algorithm mixes both centralized and decentralized approaches at different scales to produce a fast, robust method that is accurate and scalable, and redu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research Letters
سال: 2012
ISSN: 0167-6377
DOI: 10.1016/j.orl.2012.04.003